The dynamic shortest path problem with time-dependent stochastic disruptions
نویسندگان
چکیده
منابع مشابه
Influence of Spillback Effect on Dynamic Shortest Path Problems with Travel-Time-Dependent Network Disruptions
Traffic network disruptions lead to a significant increase in travel time and hence transportation costs. An efficient routing model requires a good description of the congestion dynamics. One of these dynamics is the spillback effect, i.e. congestion propagation to upstream links. This leads to a secondary delay in the upstream road where the speed of the vehicles in the upstream road decrease...
متن کاملDynamic shortest path in stochastic dynamic networks: Ship routing problem
In this paper, we apply the stochastic dynamic programming to find the dynamic shortest path from the source node to the sink node in stochastic dynamic networks, in which the arc lengths are independent random variables with exponential distributions. In each node there is an environmental variable, which evolves in accordance with a continuous time Markov process. The parameter of the exponen...
متن کاملFinding Risk-Averse Shortest Path with Time-Dependent Stochastic Costs
In this paper, we tackle the problem of risk-averse route planning in a transportation network with time-dependent and stochastic costs. To solve this problem, we propose an adaptation of the A* algorithm that accommodates any risk measure or decision criterion that is monotonic with first-order stochastic dominance. We also present a case study of our algorithm on the Manhattan, NYC, transport...
متن کاملStochastic Shortest Path Problem with Uncertain Delays
This paper considers a stochastic version of the shortest path problem, the Stochastic Shortest Path Problem with Delay Excess Penalty on directed, acyclic graphs. In this model, the arc costs are deterministic, while each arc has a random delay, assumed normally distributed. A penalty occurs when the given delay constraint is not satisfied. The objective is to minimize the sum of the path cost...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part C: Emerging Technologies
سال: 2018
ISSN: 0968-090X
DOI: 10.1016/j.trc.2018.04.018